Separations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Staged Separations ∗

The equations and the component-specific parameters needed for these detailed models are contained in specialized programs such as Aspen. However, for preliminary work it may be sufficient, and more convenient, to employ more simplified methods. If pressures are low, we may approximate φi ≈ 1 and f 0 i ≈ P sat i (T), where P sat i (T) is the vapor pressure of pure component i. Further, if the c...

متن کامل

Difficult separations

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

متن کامل

Chiral separations.

REVIEWS This review covers developments and applications in chiral separations from January 2000 to March 2002. This review is not intended to be a comprehensive review of all papers published, but focuses on major developments in the field of chiral separations as well as representative applications. The review is restricted to the English language literature except as noted for several specif...

متن کامل

Nonrelativizing Separations

We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to Kannan since we furthermore show that our result does not relativize. This is the first separation result in complexity theory that does not relativize. As a corollary to our separation result we also obtain that PEXP, ...

متن کامل

Generic Separations

In 1987, Blum and Impagliazzo, using techniques of Hartmanis and Hemachandra and Racko , show that if P = NP then P(G) = NP(G) \ coNP(G) = UP(G), where G is a generic oracle. They leave open the question as to whether these collapses occur at higher levels of the polynomial-time hierarchy, i.e., pk(G) = pk(G) \ pk(G) =U pk(G) for k 2. Here we give a negative answer to these questions. In fact, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Gerontologist

سال: 2012

ISSN: 0016-9013,1758-5341

DOI: 10.1093/geront/gns111